Combinatorial Proofs of Bivariate Generating Functions on Coxeter Groups
نویسندگان
چکیده
McMahon’s result that states the length and major index statistics are equidistributed on the symmetric group Sn has generalizations to other Coxeter groups. Adin, Brenti and Roichman have defined analogues of those statistics for the hyperoctahedral group, Bn and proved equidistribution theorems. Using combinatorial interpretations of Regev and Roichman’s statistics length and delent, we consider a specialization of the bimahonian generating function for the alternating group An. We define a new delent statistic, delL, for the alternating subgroup of the hyperoctahedral group, Ln ⊂ Bn and give a combinatorial proof of the bimahonian generating function ∑ π∈Ln q lL(π)tdelL(π). Mathematics Subject Classification: 20F55, 05A15
منابع مشابه
Cycles and Patterns in Permutations
We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating functions for inversions, ascents, descents, 123s, valleys, 1’-2-1s; closed forms for avoidance of peaks, 2-3-1s, 1-2-3s, 2’-1-2s and 1’-2-1s; bijective pro...
متن کاملA Model for the Double Cosets of Young Subgroups
There are several results concerning double cosets of Young subgroups of symmetric groups which are often proved as corollaries of more general results about Coxeter groups. In this note we give a selection of these results and give them the short combinatorial proofs they deserve. Our replacement for the machinery of Coxeter groups consists of some simple combinatorial arguments involving tabl...
متن کاملA Model for the Double Cosets of Young Subgroups
There are several results concerning double cosets of Young subgroups of symmetric groups which are often proved as corollaries of more general results about Coxeter groups. In this note we give a selection of these results and give them short combinatorial proofs. The replacement for the machinery of Coxeter groups consists of some simple combinatorial arguments involving tableaux. Inevitably ...
متن کاملCombinatorial Proofs of Hook Generating Functions for Skew Plane Partitions
Sagan, B.E., Combinatorial proofs of hook generating functions for skew plane partitions, Theoretical Computer Science 117 (1993) 273-287. We provide combinatorial proofs of two hook generating functions for skew plane partitions. One proof involves the Hillman-Grass1 (1976) algorithm and the other uses a modification of Schiitzenberger’s (1963, 1977) “jeu de taquin” due to Kadell (to appear). ...
متن کاملSe p 20 05 GENERALIZED JONES TRACES AND KAZHDAN – LUSZTIG BASES
We develop some applications of certain algebraic and combinatorial conditions on the elements of Coxeter groups, such as elementary proofs of the pos-itivity of certain structure constants for the associated Kazhdan–Lusztig basis. We also explore some consequences of the existence of a Jones-type trace on the Hecke algebra of a Coxeter group, such as simple procedures for computing leading ter...
متن کامل